0.00/0.03	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.05	% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM
0.09/0.37	% Computer : n031.cluster.edu
0.09/0.37	% Model    : x86_64 x86_64
0.09/0.37	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.37	% Memory   : 8046.5625MB
0.09/0.37	% OS       : Linux 6.8.0-71-generic
0.09/0.37	% CPULimit : 1440
0.09/0.37	% WCLimit  : 180
0.09/0.37	% DateTime : Mon Jul 27 13:13:10 UTC 2026
0.09/0.38	% CPUTime  : 
0.09/0.38	Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM
0.13/0.42	Running higher-order theorem proving
0.13/0.44	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.fuJL0RAX5o/E---3.1_47316.p
0.30/0.50	% Version: 3.5.1-ho
0.30/0.50	% Preprocessing class: HSMMSLSSLLLNHFA.
0.30/0.50	% Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.30/0.50	% Starting new_ho_10_cnf2 with 900s (5) cores
0.30/0.50	% Starting post_as_ho1 with 180s (1) cores
0.30/0.50	% Starting post_as_ho5 with 180s (1) cores
0.30/0.50	% Starting post_as_ho10 with 180s (1) cores
0.30/0.50	% post_as_ho5 with pid 47331 completed with status 0
0.30/0.50	% Result found by post_as_ho5
0.30/0.50	% Preprocessing class: HSMMSLSSLLLNHFA.
0.30/0.50	% Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.30/0.50	% Starting new_ho_10_cnf2 with 900s (5) cores
0.30/0.50	% Starting post_as_ho1 with 180s (1) cores
0.30/0.50	% Starting post_as_ho5 with 180s (1) cores
0.30/0.50	% (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true))
0.30/0.50	% SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
0.30/0.50	% Search class: HGUSS-FFSS21-SHFMMSBN
0.30/0.50	% partial match(3): HGUSM-FFSS32-SHFMMSBN
0.30/0.50	% Scheduled 7 strats onto 1 cores with 180 seconds (180 total)
0.30/0.50	% Starting SubtermCWHack with 17s (1) cores
0.30/0.50	% SubtermCWHack with pid 47333 completed with status 10
0.30/0.50	% Starting post_as_ho5 with 19s (1) cores
0.30/0.50	% post_as_ho5 with pid 47334 completed with status 0
0.30/0.50	% Result found by post_as_ho5
0.30/0.50	% Preprocessing class: HSMMSLSSLLLNHFA.
0.30/0.50	% Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.30/0.50	% Starting new_ho_10_cnf2 with 900s (5) cores
0.30/0.50	% Starting post_as_ho1 with 180s (1) cores
0.30/0.50	% Starting post_as_ho5 with 180s (1) cores
0.30/0.50	% (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true))
0.30/0.50	% SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
0.30/0.50	% Search class: HGUSS-FFSS21-SHFMMSBN
0.30/0.50	% partial match(3): HGUSM-FFSS32-SHFMMSBN
0.30/0.50	% Scheduled 7 strats onto 1 cores with 180 seconds (180 total)
0.30/0.50	% Starting SubtermCWHack with 17s (1) cores
0.30/0.50	% SubtermCWHack with pid 47333 completed with status 10
0.30/0.50	% Starting post_as_ho5 with 19s (1) cores
0.30/0.50	% Preprocessing time       : 0.002 s
0.30/0.50	% Presaturation interreduction done
0.30/0.50	
0.30/0.50	% Proof found!
0.30/0.50	% SZS status Theorem
0.30/0.50	% SZS output start CNFRefutation
0.30/0.50	thf(decl_sort1, type, term: $tType).
0.30/0.50	thf(decl_sort2, type, subst: $tType).
0.30/0.50	thf(decl_23, type, one: term).
0.30/0.50	thf(decl_26, type, sub: term > subst > term).
0.30/0.50	thf(decl_28, type, sh: subst).
0.30/0.50	thf(decl_29, type, push: term > subst > subst).
0.30/0.50	thf(decl_30, type, comp: subst > subst > subst).
0.30/0.50	thf(decl_31, type, var: term > $o).
0.30/0.50	thf(decl_46, type, ulamvar1: $o).
0.30/0.50	thf(decl_50, type, pushprop_lthm_orig: $o).
0.30/0.50	thf(decl_72, type, ulamvarind: $o).
0.30/0.50	thf(decl_83, type, axclos: $o).
0.30/0.50	thf(decl_93, type, axvarcons: $o).
0.30/0.50	thf(decl_117, type, pushprop: $o).
0.30/0.50	thf(decl_137, type, axshiftcons: $o).
0.30/0.50	thf(decl_145, type, esk1_1: (term > $o) > term).
0.30/0.50	thf(decl_146, type, epred1_0: term > $o).
0.30/0.50	thf(decl_147, type, esk2_0: term).
0.30/0.50	thf(decl_148, type, esk3_0: subst).
0.30/0.50	thf(decl_149, type, esk4_0: term).
0.30/0.50	thf(thm, conjecture, (pushprop_lthm_orig), file('/export/starexec/sandbox/tmp/tmp.fuJL0RAX5o/E---3.1_47316.p', thm)).
0.30/0.50	thf(pushprop_lthm_orig, axiom, ((pushprop_lthm_orig)<=>((ulamvar1)=>((axvarcons)=>((axclos)=>((axshiftcons)=>((ulamvarind)=>(pushprop))))))), file('/export/starexec/sandbox/tmp/tmp.fuJL0RAX5o/E---3.1_47316.p', pushprop_lthm_orig)).
0.30/0.50	thf(ulamvar1, axiom, ((ulamvar1)<=>(var @ one)), file('/export/starexec/sandbox/tmp/tmp.fuJL0RAX5o/E---3.1_47316.p', ulamvar1)).
0.30/0.50	thf(axvarcons, axiom, ((axvarcons)<=>![X1:term, X3:subst]:(((sub @ one @ (push @ X1 @ X3))=(X1)))), file('/export/starexec/sandbox/tmp/tmp.fuJL0RAX5o/E---3.1_47316.p', axvarcons)).
0.30/0.50	thf(axclos, axiom, ((axclos)<=>![X1:term, X3:subst, X4:subst]:(((sub @ (sub @ X1 @ X3) @ X4)=(sub @ X1 @ (comp @ X3 @ X4))))), file('/export/starexec/sandbox/tmp/tmp.fuJL0RAX5o/E---3.1_47316.p', axclos)).
0.30/0.50	thf(axshiftcons, axiom, ((axshiftcons)<=>![X1:term, X3:subst]:(((comp @ sh @ (push @ X1 @ X3))=(X3)))), file('/export/starexec/sandbox/tmp/tmp.fuJL0RAX5o/E---3.1_47316.p', axshiftcons)).
0.30/0.50	thf(ulamvarind, axiom, ((ulamvarind)<=>![X6:term > $o]:(((X6 @ one)=>(![X1:term]:(((var @ X1)=>((X6 @ X1)=>(X6 @ (sub @ X1 @ sh)))))=>![X1:term]:(((var @ X1)=>(X6 @ X1))))))), file('/export/starexec/sandbox/tmp/tmp.fuJL0RAX5o/E---3.1_47316.p', ulamvarind)).
0.30/0.50	thf(pushprop, axiom, ((pushprop)<=>![X6:term > $o, X1:term, X3:subst]:((![X2:term]:(((var @ X2)=>(X6 @ (sub @ X2 @ X3))))=>((X6 @ X1)=>![X2:term]:(((var @ X2)=>(X6 @ (sub @ X2 @ (push @ X1 @ X3))))))))), file('/export/starexec/sandbox/tmp/tmp.fuJL0RAX5o/E---3.1_47316.p', pushprop)).
0.30/0.50	thf(c_0_8, negated_conjecture, ~((pushprop_lthm_orig)), inference(assume_negation,[status(cth)],[thm])).
0.30/0.50	thf(c_0_9, axiom, ((pushprop_lthm_orig)=(((((var @ one)))=>((((![X43:term, X44:subst]:(((sub @ one @ (push @ X43 @ X44))=(X43)))))=>((((![X45:term, X46:subst, X47:subst]:(((sub @ (sub @ X45 @ X46) @ X47)=(sub @ X45 @ (comp @ X46 @ X47))))))=>((((![X48:term, X49:subst]:(((comp @ sh @ (push @ X48 @ X49))=(X49)))))=>((((![X50:term > $o]:((((X50 @ one))=>(((![X51:term]:((((var @ X51))=>((((X50 @ X51))=>((X50 @ (sub @ X51 @ sh))))))))=>(![X52:term]:((((var @ X52))=>((X50 @ X52)))))))))))=>((![X53:term > $o, X54:term, X55:subst]:(((![X56:term]:((((var @ X56))=>((X53 @ (sub @ X56 @ X55))))))=>((((X53 @ X54))=>(![X57:term]:((((var @ X57))=>((X53 @ (sub @ X57 @ (push @ X54 @ X55)))))))))))))))))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[pushprop_lthm_orig, ulamvar1]), axvarcons]), axclos]), axshiftcons]), ulamvarind]), pushprop])).
0.30/0.50	thf(c_0_10, negated_conjecture, ~(((var @ one)=>(![X58:term, X59:subst]:(((sub @ one @ (push @ X58 @ X59))=(X58)))=>(![X60:term, X61:subst, X62:subst]:(((sub @ (sub @ X60 @ X61) @ X62)=(sub @ X60 @ (comp @ X61 @ X62))))=>(![X63:term, X64:subst]:(((comp @ sh @ (push @ X63 @ X64))=(X64)))=>(![X65:term > $o]:(((X65 @ one)=>(![X66:term]:(((var @ X66)=>((X65 @ X66)=>(X65 @ (sub @ X66 @ sh)))))=>![X67:term]:(((var @ X67)=>(X65 @ X67))))))=>![X68:term > $o, X69:term, X70:subst]:((![X71:term]:(((var @ X71)=>(X68 @ (sub @ X71 @ X70))))=>((X68 @ X69)=>![X72:term]:(((var @ X72)=>(X68 @ (sub @ X72 @ (push @ X69 @ X70)))))))))))))), inference(apply_def,[status(thm)],[c_0_8, c_0_9])).
0.30/0.50	thf(c_0_11, negated_conjecture, ![X73:term, X74:subst, X75:term, X76:subst, X77:subst, X78:term, X79:subst, X80:term > $o, X82:term, X86:term]:(((var @ one)&(((sub @ one @ (push @ X73 @ X74))=(X73))&(((sub @ (sub @ X75 @ X76) @ X77)=(sub @ X75 @ (comp @ X76 @ X77)))&(((comp @ sh @ (push @ X78 @ X79))=(X79))&((((var @ (esk1_1 @ X80))|(~(var @ X82)|(X80 @ X82))|~(X80 @ one))&(((X80 @ (esk1_1 @ X80))|(~(var @ X82)|(X80 @ X82))|~(X80 @ one))&(~(X80 @ (sub @ (esk1_1 @ X80) @ sh))|(~(var @ X82)|(X80 @ X82))|~(X80 @ one))))&((~(var @ X86)|(epred1_0 @ (sub @ X86 @ esk3_0)))&((epred1_0 @ esk2_0)&((var @ esk4_0)&~(epred1_0 @ (sub @ esk4_0 @ (push @ esk2_0 @ esk3_0)))))))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])])])).
0.30/0.50	thf(c_0_12, negated_conjecture, ![X1:term, X6:term > $o]:(((X6 @ X1)|~((X6 @ (sub @ (esk1_1 @ X6) @ sh)))|~((var @ X1))|~((X6 @ one)))), inference(split_conjunct,[status(thm)],[c_0_11])).
0.30/0.50	thf(c_0_13, negated_conjecture, ![X1:term]:((((sub @ (esk1_1 @ (^[Z0:term]:(((Z0)!=(X1))))) @ sh)=(X1))|((one)=(X1))|~((var @ X1)))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_12])).
0.30/0.50	thf(c_0_14, negated_conjecture, (var @ esk4_0), inference(split_conjunct,[status(thm)],[c_0_11])).
0.30/0.50	thf(c_0_15, negated_conjecture, ![X1:term, X3:subst, X4:subst]:(((sub @ (sub @ X1 @ X3) @ X4)=(sub @ X1 @ (comp @ X3 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_11])).
0.30/0.50	thf(c_0_16, negated_conjecture, (((sub @ (esk1_1 @ (^[Z0:term]:(((Z0)!=(esk4_0))))) @ sh)=(esk4_0))|((one)=(esk4_0))), inference(spm,[status(thm)],[c_0_13, c_0_14])).
0.30/0.50	thf(c_0_17, negated_conjecture, ![X1:term, X6:term > $o]:(((var @ (esk1_1 @ X6))|(X6 @ X1)|~((var @ X1))|~((X6 @ one)))), inference(split_conjunct,[status(thm)],[c_0_11])).
0.30/0.50	thf(c_0_18, negated_conjecture, ![X3:subst]:((((sub @ (esk1_1 @ (^[Z0:term]:(((Z0)!=(esk4_0))))) @ (comp @ sh @ X3))=(sub @ esk4_0 @ X3))|((one)=(esk4_0)))), inference(spm,[status(thm)],[c_0_15, c_0_16])).
0.30/0.50	thf(c_0_19, negated_conjecture, ![X1:term, X3:subst]:(((comp @ sh @ (push @ X1 @ X3))=(X3))), inference(split_conjunct,[status(thm)],[c_0_11])).
0.30/0.50	thf(c_0_20, negated_conjecture, ![X1:term]:((((one)=(X1))|(var @ (esk1_1 @ (^[Z0:term]:(((Z0)!=(X1))))))|~((var @ X1)))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_17])).
0.30/0.50	thf(c_0_21, negated_conjecture, ![X1:term]:(((epred1_0 @ (sub @ X1 @ esk3_0))|~((var @ X1)))), inference(split_conjunct,[status(thm)],[c_0_11])).
0.30/0.50	thf(c_0_22, negated_conjecture, ![X1:term, X3:subst]:((((sub @ (esk1_1 @ (^[Z0:term]:(((Z0)!=(esk4_0))))) @ X3)=(sub @ esk4_0 @ (push @ X1 @ X3)))|((one)=(esk4_0)))), inference(spm,[status(thm)],[c_0_18, c_0_19])).
0.30/0.50	thf(c_0_23, negated_conjecture, (((one)=(esk4_0))|(var @ (esk1_1 @ (^[Z0:term]:(((Z0)!=(esk4_0))))))), inference(spm,[status(thm)],[c_0_20, c_0_14])).
0.30/0.50	thf(c_0_24, negated_conjecture, ~((epred1_0 @ (sub @ esk4_0 @ (push @ esk2_0 @ esk3_0)))), inference(split_conjunct,[status(thm)],[c_0_11])).
0.30/0.50	thf(c_0_25, negated_conjecture, ![X1:term]:((((one)=(esk4_0))|(epred1_0 @ (sub @ esk4_0 @ (push @ X1 @ esk3_0))))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_23])).
0.30/0.50	thf(c_0_26, negated_conjecture, ![X3:subst, X1:term]:(((sub @ one @ (push @ X1 @ X3))=(X1))), inference(split_conjunct,[status(thm)],[c_0_11])).
0.30/0.50	thf(c_0_27, negated_conjecture, ((one)=(esk4_0)), inference(spm,[status(thm)],[c_0_24, c_0_25])).
0.30/0.50	thf(c_0_28, negated_conjecture, ![X3:subst, X1:term]:(((sub @ esk4_0 @ (push @ X1 @ X3))=(X1))), inference(rw,[status(thm)],[c_0_26, c_0_27])).
0.30/0.50	thf(c_0_29, negated_conjecture, (epred1_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_11])).
0.30/0.50	thf(c_0_30, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24, c_0_28]), c_0_29])]), ['proof']).
0.30/0.50	% SZS output end CNFRefutation
0.30/0.50	% Parsed axioms                        : 238
0.30/0.50	% Removed by relevancy pruning/SinE    : 230
0.30/0.50	% Initial clauses                      : 11
0.30/0.50	% Removed in clause preprocessing      : 0
0.30/0.50	% Initial clauses in saturation        : 11
0.30/0.50	% Processed clauses                    : 101
0.30/0.50	% ...of these trivial                  : 4
0.30/0.50	% ...subsumed                          : 19
0.30/0.50	% ...remaining for further processing  : 78
0.30/0.50	% Other redundant clauses eliminated   : 0
0.30/0.50	% Clauses deleted for lack of memory   : 0
0.30/0.50	% Backward-subsumed                    : 2
0.30/0.50	% Backward-rewritten                   : 46
0.30/0.50	% Generated clauses                    : 269
0.30/0.50	% ...of the previous two non-redundant : 190
0.30/0.50	% ...aggressively subsumed             : 0
0.30/0.50	% Contextual simplify-reflections      : 1
0.30/0.50	% Paramodulations                      : 237
0.30/0.50	% Factorizations                       : 0
0.30/0.50	% NegExts                              : 3
0.30/0.50	% Equation resolutions                 : 12
0.30/0.50	% Disequality decompositions           : 0
0.30/0.50	% Total rewrite steps                  : 251
0.30/0.50	% ...of those cached                   : 183
0.30/0.50	% Propositional unsat checks           : 0
0.30/0.50	%    Propositional check models        : 0
0.30/0.50	%    Propositional check unsatisfiable : 0
0.30/0.50	%    Propositional clauses             : 0
0.30/0.50	%    Propositional clauses after purity: 0
0.30/0.50	%    Propositional unsat core size     : 0
0.30/0.50	%    Propositional preprocessing time  : 0.000
0.30/0.50	%    Propositional encoding time       : 0.000
0.30/0.50	%    Propositional solver time         : 0.000
0.30/0.50	%    Success case prop preproc time    : 0.000
0.30/0.50	%    Success case prop encoding time   : 0.000
0.30/0.50	%    Success case prop solver time     : 0.000
0.30/0.50	% Current number of processed clauses  : 17
0.30/0.50	%    Positive orientable unit clauses  : 10
0.30/0.50	%    Positive unorientable unit clauses: 0
0.30/0.50	%    Negative unit clauses             : 0
0.30/0.50	%    Non-unit-clauses                  : 7
0.30/0.50	% Current number of unprocessed clauses: 99
0.30/0.50	% ...number of literals in the above   : 317
0.30/0.50	% Current number of archived formulas  : 0
0.30/0.50	% Current number of archived clauses   : 61
0.30/0.50	% Clause-clause subsumption calls (NU) : 184
0.30/0.50	% Rec. Clause-clause subsumption calls : 123
0.30/0.50	% Non-unit clause-clause subsumptions  : 22
0.30/0.50	% Unit Clause-clause subsumption calls : 9
0.30/0.50	% Rewrite failures with RHS unbound    : 0
0.30/0.50	% BW rewrite match attempts            : 4
0.30/0.50	% BW rewrite match successes           : 4
0.30/0.50	% Condensation attempts                : 0
0.30/0.50	% Condensation successes               : 0
0.30/0.50	% Termbank termtop insertions          : 24531
0.30/0.50	% Search garbage collected termcells   : 2194
0.30/0.50	
0.30/0.50	% -------------------------------------------------
0.30/0.50	% User time                : 0.023 s
0.30/0.50	% System time              : 0.008 s
0.30/0.50	% Total time               : 0.032 s
0.30/0.50	% Maximum resident set size: 4184 pages
0.30/0.50	
0.30/0.50	% -------------------------------------------------
0.30/0.50	% User time                : 0.028 s
0.30/0.50	% System time              : 0.010 s
0.30/0.50	% Total time               : 0.038 s
0.30/0.50	% Maximum resident set size: 5120 pages
0.30/0.50	% E exiting
0.30/0.51	EOF